Minimal spanning forests
نویسندگان
چکیده
منابع مشابه
Minimal spanning forests
We study minimal spanning forests in infinite graphs, which are weak limits of minimal spanning trees from finite subgraphs corresponding to i.i.d. random labels on the edges. These limits can be taken with free or wired boundary conditions, and are denoted FMSF (free minimal spanning forest) and WMSF (wired minimal spanning forest), respectively. The WMSF is also the union of the trees that ar...
متن کاملFinding Minimal Spanning Forests in a Grap
We propose two algorithms for solving a graph partitioning problem motivated by computational topology. Specifically, given a weighted, undirected graph G and a positive integer k, we desire to find k disjoint trees within G such that each vertex of G is contained in one of the trees and the weight of largest tree is as small as possible. We are unable to find this problem in the graph partitio...
متن کاملConnectivity of Random Geometric Graphs Related to Minimal Spanning Forests
The a.s. connectivity of the Euclidean minimal spanning forest MSF(X) on a homogeneous Poisson point process X ⊂ R is an open problem for dimension d > 2. We introduce a descending family of graphs (Gn)n≥2 that can be seen as approximations to the MSF in the sense that MSF(X) = ⋂∞ n=2Gn(X). For n = 2 one recovers the relative neighborhood graph or, in other words, the β-skeleton with β = 2. We ...
متن کاملPercolation and Minimal Spanning Forests in Infinite Graphs
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected].. Institute of Mathematical Statistics is collaborating wit...
متن کاملUniform Spanning Forests
We study uniform spanning forest measures on infinite graphs, which are weak limits of uniform spanning tree measures from finite subgraphs. These limits can be taken with free (FSF) or wired (WSF) boundary conditions. Pemantle (1991) proved that the free and wired spanning forests coincide in Z d and that they give a single tree iff d 6 4. In the present work, we extend Pemantle’s alternative ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2006
ISSN: 0091-1798
DOI: 10.1214/009117906000000269